Informatics Publishing Limited

V. Umadevi Chezhian ¹, K. Ramar ², S. Geetha ³

Affiliations
1 Dept of Computer Science, College of Business and Economics, Asmara, State of Eritrea, ER
2 Dept of Computer Science Engineering, National Engineering College,Kovilpatty, IN
3 Dept of MCA, Anna University, Trichrapalli, IN

Abstract

The response time is one of the main constraints in bluetooth synchronization and message transfer. This paper provides a novel approach for calculating a probabilistic worst-case response-time for messages in the bluetooth. We are using frequency hopping mechanism in order to retrieve the useful distribution of pockets instead of the worst-case scenario in bluetooth communication. Since the bluetooth systems are not synchronized, the number of bluetooth hops which it overlaps will depend not just on the 802.11 packet's length but also on the time offset between the packet and the hops. The best option to avoid the overlap problem is the time period. This analysis was concerned only with the timing relationships between an 802.11 packet and the bluetooth hops.

Keywords

Bluetooth Synchronization, Worst-case, Response-time, Overlap, Bluetooth Hops

Full Text

   

V. Krishnapriya ¹, K. Ramar ²

Affiliations
1 Sri Ramakrishna College of Arts & Science for Women, Coimbatore-641044, IN
2 National Engineering College, Kovilpatti, IN

Abstract

Object oriented technology is a new approach for developing software systems to increase software quality, software flexibility and extensibility. Software quality cannot be improved unless it can be measured. Software metrics are units of measurement and are a potential tool to improve the quality of software. Software programmers need valid measures for evaluating and controlling the software projects. The concepts of software metrics are well established and many metrics relating to product quality have been developed and used. The primary Aim of this survey is to present the existing relevant work as complete as possible. The survey includes traditional software metrics that could be applied to object oriented programming and a set of object-oriented metrics. A historical perspective of object-oriented metrics guides researchers and developers on how to measure the quality characteristics of object oriented programming. The results can be used by quality engineers in selecting the proper set of metrics for their software projects. The future of software metrics lies in using, testing and enabling managers to make many kinds of predictions and assessments.

Keywords

OOD, OOD Metrics, Software Metrics.

Full Text

     

V. Krishnapriya ¹, K. Ramar ²

Affiliations
1 Sri Ramakrishna College of Arts & Science for Women, Coimbatore-641044, IN
2 National Engineering College, Kovilpatti, IN

Abstract

Object oriented technology is a new approach for developing software systems to increase software quality, software flexibility and extensibility. Software quality cannot be improved unless it can be measured. Software metrics are units of measurement and are a potential tool to improve the quality of software. Software programmers need valid measures for evaluating and controlling the software projects. The concepts of software metrics are well established and many metrics relating to product quality have been developed and used. The primary Aim of this survey is to present the existing relevant work as complete as possible. The survey includes traditional software metrics that could be applied to object oriented programming and a set of object-oriented metrics. A historical perspective of object-oriented metrics guides researchers and developers on how to measure the quality characteristics of object oriented programming. The results can be used by quality engineers in selecting the proper set of metrics for their software projects. The future of software metrics lies in using, testing and enabling managers to make many kinds of predictions and assessments.

Keywords

OOD, OOD Metrics, Software Metrics.

Full Text

     

M. Devapriya ¹, K. Ramar ²

Affiliations
1 Dept. of Computer Science, Government Arts College, Udumalpet, IN
2 Dept of CSE, National Engineering College, Kovilpatti-628502, IN

Abstract

Information transfer by hiding the data into a host image is a remarkable technique known by the name Digital watermarking. Digital watermarking can be functional to an assortment of fields like text, image, audio, video and software. Bundle of tools has been recognized in order to duplicate and transform the multimedia data. Consequently security is mainly an important argument that requires some mechanism to save from harm the digital multimedia data. In order to look after those multimedia data on the Internet numerous techniques are accessible including a variety of encryption techniques, steganography techniques, watermarking techniques and information hiding techniques. Digital watermarking is a technique in which one can hide the data or information in another object (cover data) and transfers it over the network. The data hiding is able to take place moreover in spatial domain or in frequency domain. This paper proposes a non-blind watermarking scheme in which the original image is decomposed into four frequency bands. The DWT coefficients in these frequency bands are then personalized in order to hide the watermark data. SVD is competent of resourcefully representing the intrinsic algebraic properties of an image, where singular values keep up a correspondence to the brightness of the image and singular vectors reflect geometry characteristics of the image. Therefore in this approach the robustness can be achieved by DWT, stability of watermark image is increased by SVD, and imperceptibility is ensured by the use of enhanced DWT domain human visual model. The performance comparison of the algorithms among the first three levels of frequency band decomposition is taken into account on order to investigate the efficiency of the proposed approach.

Keywords

Discrete Wavelet Transformation (DWT), Digital Image Watermarking, Human Visual Model, Imperceptibility, Singular Value Decomposition (SVD).

Full Text

     

J. Avanija ¹, K. Ramar ²

Affiliations
1 Department of Computer Applications, Velammal College of Engineering and Technology, Madurai, IN
2 Sri Vidhya College of Engineering and Technology, Virudhunagar, IN

Abstract

With the massive growth and large volume of the web it is the function of search engine to recover results based on the user preferences. But most of the time the user gets useless pages. The next generation web architecture, semantic web reduces the burden of the user by performing search based on semantics instead of keywords. A conceptual graph (CG) is a notation for logic based on the existential graphs and the semantic networks of artificial intelligence. Conceptual graphs are formally defined in an abstract syntax that is independent of any notation, but the formalism can be represented in several different concrete notations. Conceptual graph representation is used in the conservation of text to semantic relations in order to minimize the edges. In this paper, we propose a relation based page ranking algorithm using genetic algorithm and conceptual graph which can be used along with semantic search engine. The proposed method uses Jena API and GATE tool API and the documents can be recovered based on their annotation features and relations. A preliminary experiment shows that the proposed method generates relevant documents in higher ranking.

Keywords

Component, Conceptual Graph (CG), Gate Tool API, Jena API, Semantic Web.

Full Text

     

M. Malathi ¹, K. Ramar ², C. Paramasivam ³

Affiliations
1 Department of Computer Science and Engineering, Vaigai College of Engineering, Madurai – 625106, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Einstein College of Engineering, Seethaparpanalur, Tirunelveli – 627012, Tamil Nadu, IN
3 Department of Mechanical Engineering, Thiagarajar College of Engineering, Madurai – 625005, IN

Abstract

Objective: To get collision free feasible path for mobile robot application in manufacturing environment based on watershed segmentation technique through simulation using Matlab code. Methodology: A Matlab code has been written in order to simulate the collision free path to complete a task by the mobile robot. The watershed algorithm is proposed and implemented for a sample image of a working environment representing different machines as rectangular shapes using Matlab code to obtain water rigid line. Findings: The concept of natural watershed is simulated for mobile robot application. Finally, the water rigid lines are obtained using Matlab code. The simulation of this work is tested with different sample images and it works satisfactorily. Applications/Improvements: Water rigid lines are considered as collision free feasible paths for mobile robot to perform certain task like material distribution in manufacturing system.

Keywords

Marker Controlled Approach, Water Rigid Line and Obstacle Avoidance, Watershed Algorithm

Full Text

   

J. Shajeena ¹, K. Ramar ²

Affiliations
1 Department of Computer Science and Engineering, James College of Engineering and Technology, IN
2 Einstein College of Engineering, IN

Abstract

Tracking is essentially a matching problem. This paper proposes a tracking scheme for video objects on compressed domain. This method mainly focuses on locating the object region and evolving the detection of movement, which improves tracking precision. Motion Vectors (MVs) are used for block matching. At each frame, the decision of whether a particular block belongs to the object being tracked is made with the help of histogram matching. During the process of matching and evolving the direction of movement, similarities of target region are compared to ensure that there is no overlapping and tracking performed in a right way. Experiments using the proposed tracker on videos demonstrate that the method can reliably locate the object of interest effectively.

Keywords

Motion Vector, Euclidean Distance, Histogram, Block Matching, DCT.

Full Text

     

N. Sivaram ¹, K. Ramar ²

Affiliations
1 Department of Computer Science and Engineering, National Engineering College, Tamil Nadu, IN
2 Sri Vidhya College of Engineering and Technology, Tamil Nadu, IN

Abstract

Recruitment of the most appropriate employees and their retention are the immense challenges for the HR department of most of the industries. Every year IT companies recruit fresh graduates through their campus selection programs. Usually industries examine the skills of the candidate by conducting tests, group discussion and number of interviews. This process requires enormous amount of effort and investment. During each phase of the recruitment process, candidates are filtered based on some performance criteria. The problem domain is complex and the aspects of candidates that impact the recruitment process is not explicit. The intelligence of the recruitment process is spread among the domain experts and extracted through knowledge acquisition techniques. This research focuses on investigating the underlying criteria and tries to capitalize on the existing patterns, to minimize the effort made during the recruitment process. The approach here is to provide the insights through in-depth empirical characterization and evaluation of decision trees for the recruitment problem domain. Experiments were conducted with the data collected from an IT industry to support their hiring decisions. Pruned and unpruned trees were constructed using ID3, C4.5 and CART algorithms. It was observed that the performance of the C4.5 algorithm is high. The recruitment process differs for each industry based on the nature of the projects carried out. Experiments were conducted to determine the attributes that best fits the problem domain. Using the constructed decision trees discussions were made with the domain experts to deduce viable decision rules.

Keywords

Recruitment Process, Decision Trees, Selection Criteria, Machine Learning.

Full Text

     

V. Krishnapriya ¹, K. Ramar ²

Affiliations
1 Dept. of Computer Science, Sri Ramakrishna College of Arts and Science for Women, Coimbatore, Tamilnadu, IN
2 Sri Vidya College of Engineering and Technology, Virudhunagar, Tamilnadu, IN

Abstract

It is widely acknowledged that in software engineering, the usage of metrics at the initial phases of the object oriented software can help designers to make better decisions. The quality of class diagrams could be a major determinant for the quality of the software product that is finally delivered. Quantitative measurements are useful to assess class diagram quality. Following this innovative thinking, two UML class diagrams are taken to measure the complexity and size. A set of metrics of complexity measures are used to measure the class diagrams. Seven known complexity measures are evaluated and compared for inheritance and interface usage in object oriented programming. Two UML class diagrams are introduced with possible interfaces and measured the complexity metrics and a comparison has been made between the class inheritance and class interface usage through complexity measurements.

Keywords

Class Diagrams, Interface Diagrams, Object Oriented Metrics, UML, Complexity.

Full Text

   

J. Shajeena ¹, K. Ramar ²

Affiliations
1 Department of Computer Science and Engineering, James College of Engineering and Technology, IN
2 Einstein College of Engineering, IN

Abstract

This paper presents an ideal method for object tracking directly in the compressed domain in video sequences. An enhanced rotation-invariant image operator called Largest Difference Indexed Local Ternary Pattern (LDILTP) has been proposed. The Local Ternary Pattern which worked very well in texture classification and face recognition is now extended for rotation invariant object tracking. Histogramming the LTP code makes the descriptor resistant to translation. The histogram intersection is used to find the similarity measure. This method is robust to noise and retain contrast details. The proposed scheme has been verified on various datasets and shows a commendable performance.

Keywords

LTP, Motion Vector, Rotation-Invariant, Histogram, Object Tracking, DCT.

Full Text

     

V. Umadevi Chezhian ¹, K. Ramar ²

Affiliations
1 Department of Computer Science, University of Asmara, ER
2 Department of Computer Science Engineering, National Engineering College, Kovilpatti, IN

Abstract

The third-generation universal mobile telecommunications system uses the high signal bandwidth for the WCDMA system (5 MHz) allows the received signal to be split into distinct multipath with high resolution. The rake receiver combines the received signals from different paths into a composite signal with substantially better characteristics for demodulation than a single path and maximizing the amount of received signal energy. This paper derived both the combination of rake receiver and equalizer. The output of the rake receiver is fed to the equalizer for filter the white noise presence in the receiving signal. This will give us a good reception of WCDMA signal at the receiver end.

Keywords

Equalizer, Multipath, Rake Receiver, WCDMA, White Noise.

Full Text